Predicting Pharmaceutical Particle Size Distributions Using Kernel Mean Embedding
نویسندگان
چکیده
منابع مشابه
Kernel Mean Embedding of Distributions: A Review and Beyond
A Hilbert space embedding of a distribution—in short, a kernel mean embedding—has recently emerged as a powerful tool for machine learning and inference. The basic idea behind this framework is to map distributions into a reproducing kernel Hilbert space (RKHS) in which the whole arsenal of kernel methods can be extended to probability measures. It can be viewed as a generalization of the origi...
متن کاملMonte Carlo Filtering Using Kernel Embedding of Distributions
Recent advances of kernel methods have yielded a framework for representing probabilities using a reproducing kernel Hilbert space, called kernel embedding of distributions. In this paper, we propose a Monte Carlo filtering algorithm based on kernel embeddings. The proposed method is applied to state-space models where sampling from the transition model is possible, while the observation model ...
متن کاملImitation Learning via Kernel Mean Embedding
Imitation learning refers to the problem where an agent learns a policy that mimics the demonstration provided by the expert, without any information on the cost function of the environment. Classical approaches to imitation learning usually rely on a restrictive class of cost functions that best explains the expert’s demonstration, exemplified by linear functions of pre-defined features on sta...
متن کاملAnalysis of Changes on Mean Particle Size in a Fluidized Bed using Vibration Signature
Vibration signals were measured in a lab-scale fluidized bed to investigate the changes in particle sizes. Experiments were carried out in the bed with a different mass fraction of coarser particles at different superficial gas velocities, and probe heights. The S-statistic test evaluates the dimensionless squared distance between two attractors reconstructed from time series of vibration signa...
متن کاملKernel least mean square with adaptive kernel size
Kernel adaptive filters (KAF) are a class of powerful nonlinear filters developed in Reproducing Kernel Hilbert Space (RKHS). The Gaussian kernel is usually the default kernel in KAF algorithms, but selecting the proper kernel size (bandwidth) is still an open important issue especially for learning with small sample sizes. In previous research, the kernel size was set manually or estimated in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pharmaceutics
سال: 2020
ISSN: 1999-4923
DOI: 10.3390/pharmaceutics12030271